Minimal Crystallizations of 3-Manifolds
نویسندگان
چکیده
We have introduced the weight of a group which has a presentation with number of relations is at most the number of generators. We have shown that the number of facets of any contracted pseudotriangulation of a connected closed 3-manifold M is at least the weight of the fundamental group of M . This lower bound is sharp for the 3-manifolds RP, L(3, 1), L(5, 2), S1 × S1 × S1, S2 × S1, S×− S1 and S/Q8, where Q8 is the quaternion group. Moreover, there is a unique such facet minimal pseudotriangulation in each of these seven cases. We have also constructed contracted pseudotriangulations of L(kq − 1, q) with 4(q + k − 1) facets for q > 3, k > 2 and L(kq + 1, q) with 4(q + k) facets for q > 4, k > 1. By a recent result of Swartz, our pseudotriangulations of L(kq + 1, q) are facet minimal when kq + 1 are even. In 1979, Gagliardi found presentations of the fundamental group of a manifold M in terms of a contracted pseudotriangulation of M . Our construction is the converse of this, namely, given a presentation of the fundamental group of a 3-manifold M , we construct a contracted pseudotriangulation of M . So, our construction of a contracted pseudotriangulation of a 3-manifold M is based on a presentation of the fundamental group of M and it is computer-free.
منابع مشابه
Catalogues of PL-manifolds and complexity estimations via crystallization theory
Crystallization theory is a graph-theoretical representation method for compact PL-manifolds of arbitrary dimension, with or without boundary, which makes use of a particular class of edge-coloured graphs, which are dual to coloured (pseudo-) triangulations. These graphs are usually called gems, i.e. Graphs Encoding Manifolds, or crystallizations if the associated triangulation has the minimal ...
متن کاملMatveev ’ S Complexity via Crystallization Theory : the Orientable Case ∗
Following the notion of GM-complexity introduced in [8], the present paper performs a graph-theoretical approach to (Matveev’s) complexity computation for closed orientable 3-manifolds. In particular, upper bounds for Matveev’s complexity of closed orientable 3-manifolds triangulated by 28 tetrahedra at most (which are encoded by existing crystallization catalogue C28 due to [17]) are proved to...
متن کامل0 M ay 2 00 7 Nonorientable 3 - manifolds admitting coloured triangulations with at most 30 tetrahedra ∗
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer procedures, all rigid nonbipartite crystallizations up to 30 vertices. 2000 Mathematics Subject Classification: 57Q15, 57M15, 57N10.
متن کاملA simple proof of orientability in colored group field theory
BACKGROUND Group field theory is an emerging field at the boundary between Quantum Gravity, Statistical Mechanics and Quantum Field Theory and provides a path integral for the gluing of n-simplices. Colored group field theory has been introduced in order to improve the renormalizability of the theory and associates colors to the faces of the simplices. The theory of crystallizations is instead ...
متن کاملStatistical cosymplectic manifolds and their submanifolds
In this paper, we introduce statistical cosymplectic manifolds and investigate some properties of their tensors. We define invariant and anti-invariant submanifolds and study invariant submanifolds with normal and tangent structure vector fields. We prove that an invariant submanifold of a statistical cosymplectic manifold with tangent structure vector field is a cosymplectic and minimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014